Deciding the Bell Number for Hereditary Graph Properties
نویسندگان
چکیده
منابع مشابه
Deciding the Bell Number for Hereditary Graph Properties - (Extended Abstract)
A graph property is a set of graphs closed under isomorphism. A property is hereditary if it is closed under taking induced subgraphs. Given a graph property X , we write Xn for the number of graphs in X with vertex set {1, 2, . . . , n} and following [1] we call Xn the speed of the property X . The paper [2] identifies a jump in the speed of hereditary graph properties to the Bell number Bn an...
متن کاملA jump to the bell number for hereditary graph properties
A hereditary graph property is a collection of labeled graphs, closed under isomorphism and also under the taking of induced subgraphs. Its speed is the number of graphs in the property as a function of the number of vertices in the graph. Earlier research has characterized the speeds for hereditary graph properties up to n(1+o(1))n, and described the properties that have those smaller speeds. ...
متن کاملDeciding Parity of Graph Crossing Number∗
We prove that it is NP-hard to determine whether the crossing number of an input graph is even or odd.
متن کاملGraph limits and testing hereditary graph properties
We show that an important recent result of Alon and Shapira on testing hereditary graph properties can be derived from the existence of a limit object for convergent graph sequences.
متن کاملGraph limits and hereditary properties
We collect some general results on graph limits associated to hereditary classes of graphs. As examples, we consider some classes defined by forbidden subgraphs and some classes of intersection graphs, including triangle-free graphs, chordal graphs, cographs, interval graphs, unit interval graphs, threshold graphs, and line graphs.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Discrete Mathematics
سال: 2016
ISSN: 0895-4801,1095-7146
DOI: 10.1137/15m1024214